package algotithm.weekendrace.leetcode237.test1;

/**
 * @author zhouyanxiang
 * @Date 2021-04-2021/4/18-10:23
 */
public class Solution {

    public static void main(String[] args) {
        Solution solution = new Solution();
    }

    public boolean checkIfPangram(String s) {
        int[] cnt = new int[26];
        for (int i = 0; i < s.length(); i++) {
            cnt[s.charAt(i) - 'a']++;
        }
        for (int i = 0; i < cnt.length; i++) {
            if (cnt[i]  < 1) {
                return false;
            }
        }
        return true;
    }
}
